Entropy-based worm detection for fast IP networks
نویسنده
چکیده
منابع مشابه
Cross Entropy-Based High-Impedance Fault Detection Algorithm for Distribution Networks
The low fault current of high-impedance faults (HIFs) is one of the main challenges for the protection of distribution networks. The inability of conventional overcurrent relays in detecting these faults results in electric arc continuity that it causes the fire hazard and electric shock and poses a serious threat to human life and network equipment. This paper presents an HIF detection algori...
متن کاملCooperative Containment of Fast Scanning Worms
Scanning worms, that spread by probing the IP address space to find vulnerable hosts, are among the most serious threats to Internet security today, as evident by the time-scales of some recent large-scale worm attacks. Only an automatic defense can hope to contain a carefully designed worm that uses an unknown or a recently-divulged vulnerability. In this paper, we propose a cooperation-based ...
متن کاملModeling and Detection of Camouflaging Worm using IP Traceback
Active worms pose major security threats to the Internet. This is due to the ability of active worms to propagate in an automated fashion as they continuously compromise computers on the Internet. Active worms evolve during their propagation, and thus, pose great challenges to defend against them. A new class of active worms, referred to as Camouflaging Worm (C-Worm in short). The C-Worm is dif...
متن کاملWormShield: Fast Worm Signature Detection with Distributed Fingerprint Aggregation
Distributed Fingerprint Aggregation ∗ Min Cai, Kai Hwang, Jianping Pan, and Christos Papadopoulos Abstract: Fast detection of worm signatures is essential to contain zero-day worms using content filtering. Recent work has shown that it is feasible to detect worm signatures automatically by analyzing the repetition of worm substrings (i.e., fingerprints) and their address dispersion. However, at...
متن کاملA Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications
A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008